EOL languages are not codings of FPOL languages

FPOL Systems Generating Counting Languages

— Counting languages are the languages of the form {axa\.. .a n t\ t^2, n^ 1} where au ..., atare letters no two consécutive ofwhich are identical. They possess a "clean structure" in the sensé that if an arbitrary wordfrom such a language is eut in t subwords ofequal length then no two consécutive subwords contain an occurrence of the same letter, It is shown that whenever an FPOL system G is ...

A Tranlsational Theorem for the Class of EOL Languages

If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(Ki,Kz) denotes the shuffle of the languages K i and K2, and a is a symbol not in the alphabet of K). Hence the class of context-free languages is the largest full AFL inside the class of EOL languages.

Why verb - initial languages are not frequent

In our simulations with simple recurrent networks we demonstrate that small artificial languages are learnt worse or better depending on their basic word order. We show that verb-initial languages are difficult to learn, reflecting the lower frequency of verb-initial natural languages. We try to go beyond mere simulations proposing two objective mathematical measures to explain our results.

Iranian Languages as Gardens

Are Logical Languages Compositional?

In this paper I argue that in contrast to natural languages, logical languages typically are not compositional. This does not mean that the meaning of expressions cannot be determined at all using some well-defined set of rules. It only means that the meaning of an expression cannot be determined without looking at its form. If one is serious about the compositionality of a logic, the only poss...